Shapelet Classification Algorithm Based on Efficient Subsequence Matching
نویسندگان
چکیده
منابع مشابه
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data space using different metrics. However, searching high-dimensional spaces using a hierarchical index is not always efficient because a large portion of the index might need to be accessed during search. We have revisit...
متن کاملAn Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment
Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...
متن کاملAn efficient image matching algorithm based on culture evolution
In image matching research, how to ensure that best match’s accuracy of the premise and a significant reduction in the amount of computing is the focus of concern by researchers. Search strategy to find the best match location of the image matching process to determine the amount of computing of image matching, in the existing image matching method are used to traverse search strategy, it is di...
متن کاملAn Efficient Parallel String Matching Algorithm Based on DFA
The classical string matching algorithms are facing a great challenge on speed due to the rapid growth of information on Internet. Meanwhile, multicore CPU has been widespread on computers. But classical string matching algorithms does not apply to multi-core CPU flexibly. It not only affects the run-time speed, but also makes a waste of the resource on CPU. In this paper, we proposed a paralle...
متن کاملMusic Matching Based on Rough Longest Common Subsequence
In this paper we proposed a music matching method, called the RLCS (rough longest common subsequence) method. It is an improved version of the LCS to avoid some problems occurring in global alignment matching. First a rough equality for two notes is defined for constructing the RLCS of two music fragments. The length of the RLCS of two music sequences defined in this work is a real number, call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Science Journal
سال: 2018
ISSN: 1683-1470
DOI: 10.5334/dsj-2018-006